Spectral Signal Unmixing with Interior-Point Nonnegative Matrix Factorization
نویسنده
چکیده
Nonnegative Matrix Factorization (NMF) is an unsupervised learning method that has been already applied to many applications of spectral signal unmixing. However, its efficiency in some applications strongly depends on optimization algorithms used for estimating the underlying nonnegatively constrained subproblems. In this paper, we attempt to tackle the optimization tasks with the inexact Interior-Point (IP) algorithm that has been successfully applied to image deblurring [S. Bonettini, T. Serafini, 2009]. The experiments demonstrate that the proposed NMF algorithm considerably outperforms the well-known NMF algorithms for blind unmixing of the Raman spectra.
منابع مشابه
جداسازی طیفی و مکانی تصاویر ابرطیفی با استفاده از Semi-NMF و تبدیل PCA
Unmixing of remote-sensing data using nonnegative matrix factorization has been considered recently. To improve performance, additional constraints are added to the cost function. The main challenge is to introduce constraints that lead to better results for unmixing. Correlation between bands of Hyperspectral images is the problem that is paid less attention to it in the unmixing algorithms. I...
متن کاملArea-Correlated Spectral Unmixing Based on Bayesian Nonnegative Matrix Factorization
To solve the problem of the spatial correlation for adjacent areas in traditional spectral unmixing methods, we propose an area-correlated spectral unmixing method based on Bayesian nonnegative matrix factorization. In the proposed method, the spatial correlation property between two adjacent areas is expressed by a priori probability density function, and the endmembers extracted from one of t...
متن کاملSpectral unmixing using nonnegative matrix factorization with smoothed L0 norm constraint
Sparse nonnegative matrix factorization (NMF) is exploited to solve spectral unmixing. Firstly, a novel model of sparse NMF is proposed, where the smoothed L0 norm is used to control the sparseness of the factors corresponding to the abundances. Thus, one need not set the degree of the sparseness in prior any more. Then, a gradient based algorithm NMF-SL0 is utilized to solve the proposed model...
متن کاملMinimum distance constrained nonnegative matrix factorization for the endmember extraction of hyperspectral images
Endmember extraction and spectral unmixing is a very challenging task in multispectral/hyperspectral image processing due to the incompleteness of information. In this paper, a new method for endmember extraction and spectral unmixing of hyperspectral images is proposed, which is called as minimum distance constrained nonnegative matrix factorization (MDC-NMF). After being compared with a newly...
متن کاملB-Spline Smoothing of Feature Vectors in Nonnegative Matrix Factorization
Nonnegative Matrix Factorization (NMF) captures nonnegative, sparse and parts-based feature vectors from the set of observed nonnegative vectors. In many applications, the features are also expected to be locally smooth. To incorporate the information on the local smoothness to the optimization process, we assume that the features vectors are conical combinations of higher degree B-splines with...
متن کامل